Sphere Packing Modulation in the SDMA Uplink Using K -Best Sphere Detection
نویسندگان
چکیده
Recently, the turbo-detected sphere packing (SP) aided space-time block-coding (STBC) STBC-SP scheme was demonstrated to provide useful performance improvements over conventionally-modulated orthogonal design-based STBC schemes in the context of single-user multiple-input multiple-output (SU-MIMO) systems. Hence, in this letter, we extend its employment to the multiuser MIMO (MU-MIMO) scenario. For the sake of achieving a near maximum a posteriori (MAP) performance while imposing a moderate complexity, we specifically design the -best sphere detection (SD) scheme for supporting the operation of the SP-modulated system, since the conventional SD cannot be directly applied to such a system. Consequently, with the aid of our modified SD, a significant performance gain can be achieved by the SP-modulated system over its conventionally-modulated counterpart in the context of MU-MIMO systems.
منابع مشابه
Flex-Sphere: An FPGA Configurable Sort-Free Sphere Detector For Multi-user MIMO Wireless Systems
Spatial division multiplexing (SDM) in MIMO technology significantly increases the spectral efficiency, and hence capacity, of a wireless communication system: it is a core component of the next generation wireless systems, e.g. WiMAX, 3GPP LTE and other OFDM-based communication schemes. Moreover, spatial division multiple access (SDMA) is one of the widely used techniques for sharing the wirel...
متن کاملOptimum multiuser detection for MC-CDMA systems using sphere decoding
The Maximum Likelihood joint detection of all users in a Multi-Carrier Code Division Multiple Access (MCCDMA) system has a prohibitive complexity, growing exponentially with the number of users, when it is performed using an exhaustive search. In this paper, a novel ML multiuser detection algorithm is proposed, whose complexity is a polynomial function of the number of users and is independent ...
متن کاملNew Upper Bounds on Sphere Packings I
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کامل1 O ct 2 00 1 NEW UPPER BOUNDS ON SPHERE PACKINGS
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کاملNew Upper Bounds on Sphere Packings I
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Signal Process. Lett.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009